Medial Axis LUT Computation for Chamfer Norms Using H-Polytopes
نویسندگان
چکیده
Chamfer distances are discrete distances based on the propagation of local distances, or weights defined in a mask. The medial axis, i.e. the centers of the maximal disks (disks which are not contained in any other disk), is a powerful tool for shape representation and analysis. The extraction of maximal disks is performed in the general case with comparison tests involving look-up tables representing the covering relation of disks in a local neighborhood. Although look-up table values can be computed efficiently, the computation of the look-up table neighborhood tend to be very timeconsuming. By using polytope descriptions of the chamfer disks, the necessary operations to extract the look-up tables are greatly reduced. @inproceedings{normand2008dgci, Title = {Medial Axis {LUT} Computation for Chamfer Norms Using {H}-Polytopes}, Author = {Normand, Nicolas and {\’E}venou, Pierre}, Booktitle = {Discrete Geometry for Computer Imagery}, Editor = {Coeurjolly, David and Sivignon, Isabelle and Tougne, Laure and Dupont, Florent}, Doi = {10.1007/978-3-540-79126-3_18},
منابع مشابه
Medial axis lookup table and test neighborhood computation for 3D chamfer norms
Chamfer distances are discrete distances based on the propagation of local distances, or weights, defined in a mask. The medial axis, i.e. the centers of maximal balls (balls which are not contained in any other ball), is a powerful tool for shape representation and analysis. The extraction of maximal disks is performed in the general case by testing the inclusion of a ball in a local neighborh...
متن کاملAppearance Radii in Medial Axis Test Mask for Small Planar Chamfer Norms
The test mask TM is the minimum neighbourhood sufficient to extract the medial axis of any discrete shape, for a given chamfer distance mask M. We propose an arithmetical framework to study TM in the case of chamfer norms. We characterize TM for 3×3 and 5×5 chamfer norm masks, and we give an algorithm to compute the appearance radius of the vector (2, 1) in TM.
متن کامل2D Subquadratic Separable Distance Transformation for Path-Based Norms
In many applications, separable algorithms have demonstrated their efficiency to perform high performance and parallel volumetric computations, such as distance transformation or medial axis extraction. In the literature, several authors have discussed about conditions on the metric to be considered in a separable approach. In this article, we present generic separable algorithms to efficiently...
متن کاملExact medial axis with euclidean distance
Medial Axis (MA), also known as Centres of Maximal Disks, is a useful representation of a shape for image description and analysis. MA can be computed on a distance transform, where each point is labelled to its distance to the background. Recent algorithms allow one to compute Squared Euclidean Distance Transform (SEDT) in linear time in any dimension. While these algorithms provide exact meas...
متن کاملChordal Axis on Weighted Distance Transforms
Chordal Axis (CA) is a new representation of planar shapes introduced by Prasad in [7], useful for skeleton computation, shape analysis, characterization and recognition. The CA is a subset of chord and center of disks tangent to the contour of a shape, derivated from Medial Axis (MA). Originally presented in a computational geometry approach, the CA was extracted on a constrained Delaunay tria...
متن کامل